Lower and upper bounds for the non-linear generalized assignment problem
نویسندگان
چکیده
منابع مشابه
Lower Bounds for the Quadratic Assignment Problem
We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new lower bounds have advantages over previous bounds and can be used in a branch-and-bound type algorithm for...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملUpper and lower bounds for the fixed spectrum frequency assignment problem
Asurvey of the results described in the author’s PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known metaheuristic paradigms, and new lower bounding techniques, based on linear programm...
متن کاملComputing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
A typical example of the quadratic assignment problem (QAP) is the facility location problem, in which a set of n facilities are to be assigned, at minimum cost, to an equal number of locations. Between each pair of facilities, there is a given amount of flow, contributing a cost equal to the product of the flow and the distance between locations to which the facilities are assigned. Proving op...
متن کاملLower and Upper Bounds for the Master Bay Planning Problem
In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2020
ISSN: 0305-0548
DOI: 10.1016/j.cor.2020.104933